// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
const int maxn=30005;
int n,m,q;
bitset<maxn> s[maxn];
signed main()
{
	int t=1;
//	cin>>t;
	while(t--)
	{
		cin>>n>>m>>q;
		for(int i=1,c,x;i<=n;i++)
		{
			for(cin>>c;c;--c)
			{
				cin>>x;
				s[i].set(x,1);
			}
		}
		for(int i=1;i<=m;i++)s[0].set(i,1);
		for(int o,x,y;q;--q)
		{
			cin>>o>>x>>y;
			if(o==1)
			{
				s[x]<<=y;
				s[x]&=s[0];
			}
			else if(o==2)
			{
				s[x]>>=y;
				s[x]&=s[0];
			}
			else if(o==3)
			{
				cout<<(s[x]&s[y]).count()<<endl;
			}
			else if(o==4)
			{
				cout<<(s[x]|s[y]).count()<<endl;
			}
			else if(o==5)
			{
				cout<<(s[x]^s[y]).count()<<endl;
			}
		}
	}
	return 0;
}
